搜索资源列表
BranchAndMincut_code
- MINIMUM GRAPH CUT FOR IMAGE SEG AND RECOGNITION
Maxiflowminicut
- 最大流和最小截算法，在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-Maximum flow and minimum cut algorithms, in this function exists in the preparation of a detail, if any label does not take a check point has been, I get the most fr
3041
- poj 第3041_Asteroids题，最小顶点覆盖 网络流 最小割 邻接表-poj first 3041_Asteroids problem, minimum vertex cover network flow minimum cut adjacency list
maxflow-v2.21.src
- 最大流最小割算法的c++源代码,用于图像分割和处理领域-Minimum cut maximum flow algorithm c++ source code for image segmentation and processing
zuidaliu
- 最大流最小截问题，用ｍａｔｌａｂ编写的，ｒａｒ中有说明，较清晰-Maximum flow minimum cut problem, written with matlab, rar have stated more clearly
cc
- 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
MaxFlow
- 最大流最小割 可以测试某一个特定的图 也可以随机生成n个顶点的图和k条边 用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
TQ2440min
- 使用ADS1.2自己裁剪的最小程序，芯片为S3C2440.功能内附-Using the minimum cut ADS1.2 own procedures, chip S3C2440. Features included
ALE
- 图像分割算法，是基于最小切最大流算法的分割方法。-The image segmentation algorithm is a segmentation method based on the maximum flow minimum cut algorithm.
dijkstra
- 用于图像分割的dijkstra距离的计算，用于最大流最小割等算法-To dijkstra distance calculation used to image segmentation for the maximum flow minimum cut algorithm
Graph-theory-algorithm-set
- 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m
dinic_l
- 主要实现图片的打开，并用最大流最小割定理实现图片的切割-Picture open, and the maximum flow minimum cut theorem of pictures cut
Algorithm
- 一些算法的简单实现，最大流最小割、B树、最大堆、最短路径等-Simple implementation of the algorithm, the maximum flow minimum cut tree B, the maximum heap shortest path
Fault-Tree
- 求故障树的 1）对偶树； 2）最小割级和最小路集； 3）假定底事件的故障概率已知，求顶事件发生的概率； 4）求底事件的结构重要度、概率重要度和关键重要度。-Seeking Fault Tree 1) dual tree 2) minimum cut level and minimal path sets 3) It is assumed that the end of the event of the failure probability known, find the p
MinCut
- 实现最小割，基于图的图像分割算法，学习必备。-Minimum cut graph-based image segmentation algorithm, learning essential.
Maxflow_MinCut
- 最大流最小割算法的VC++实现，用于得出网络原点到终点之间的最大流量限制。-The minimum cut VC++ flow of the algorithm is realized that network origin to finish between the peak flow restrictions.
max_min_segment
- 最大流/最小割方法。为学习图像处理中的图割算法做准备，算法思想是Ford-Fulkerson方法。最大流是一个有向图，最小割就是网络中所有割中值最小的那个割。 -Maximum flow/minimum cut method. As a learning image processing to prepare graph cut algorithm, the algorithm idea is Ford-Fulkerson method.
algo004
- 斯坦福机器学习公开课作业求最小割的作业答案，python实现，运行结果已经经过验证-Stanford Machine Learning Homework for the minimum cut open job answer, python implementation, the results have been proven
zuidaliu
- 最大流最小截问题，用ｍａｔｌａｂ编写的，ｒａｒ中有说明，较清晰-Maximum flow minimum cut problem, using matlab prepared, rar have stated more clearly
GRAPH_CUT_STEREO_AA
- 全局立体匹配一直是一个比较困难的问题，本算法通过C++编译器，实现了全局立体匹配算法，希望对你有帮助-Stereo matching algorithm based on graph cuts, using the maximum flow/minimum cut methods to achieve global stereo matching.